Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problème étoile")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

A note on the expressibility problem for modal logics and star-free regular expressionsTEN CATE, Balder.Information processing letters. 2009, Vol 109, Num 10, pp 509-513, issn 0020-0190, 5 p.Article

New results on the star problem in trace monoidsMETIVIER, Y; RICHOMME, G.Information and computation (Print). 1995, Vol 119, Num 2, pp 240-251, issn 0890-5401Article

Classifying regular languages by a split gameQIQI YAN.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 181-190, issn 0304-3975, 10 p.Article

Two techniques in the area of the star problem in trace monoidsKIRSTEN, Daniel; MARCINKOWSKI, Jerzy.Theoretical computer science. 2003, Vol 309, Num 1-3, pp 381-412, issn 0304-3975, 32 p.Article

The ring-star problem: A new integer programming formulation and a branch-and-cut algorithmSIMONETTI, L; FROTA, Y; DE SOUZA, C. C et al.Discrete applied mathematics. 2011, Vol 159, Num 16, pp 1901-1914, issn 0166-218X, 14 p.Conference Paper

APPROXIMATING THE SPANNING STAR FOREST PROBLEM AND ITS APPLICATION TO GENOMIC SEQUENCE ALIGNMENTTHACH NGUYEN, C; JIAN SHEN; MINMEI HOU et al.SIAM journal on computing (Print). 2009, Vol 38, Num 3, pp 946-962, issn 0097-5397, 17 p.Article

Online searching with turn costDEMAINE, Erik D; FEKETE, Sandor P; GAL, Shmuel et al.Theoretical computer science. 2006, Vol 361, Num 2-3, pp 342-355, issn 0304-3975, 14 p.Article

Cop-robber guarding game with cycle robber-regionNAGAMOCHI, Hiroshi.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 383-390, issn 0304-3975, 8 p.Article

The complete optimal stars-clustering-tree problemKORACH, Ephraim; STERN, Michal.Discrete applied mathematics. 2008, Vol 156, Num 4, pp 444-450, issn 0166-218X, 7 p.Conference Paper

Graph bandwidth of weighted caterpillarsMINGEN LIN; ZHIYONG LIN; JINHUI XU et al.Theoretical computer science. 2006, Vol 363, Num 3, pp 266-277, issn 0304-3975, 12 p.Conference Paper

The sandwich problem for cutsets : Clique cutset, k-star cutsetTEIXEIRA, Rafael B; HERRERA DE FIGUEIREDO, Celina M.Discrete applied mathematics. 2006, Vol 154, Num 13, pp 1791-1798, issn 0166-218X, 8 p.Conference Paper

Adaptive star grammars and their languagesDREWES, Frank; HOFFMANN, Berthold; JANSSENS, Dirk et al.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3090-3109, issn 0304-3975, 20 p.Article

The common prefix problem on treesKENKRE, Sreyash; VISHWANATHAN, Sundar.Information processing letters. 2008, Vol 105, Num 6, pp 245-248, issn 0020-0190, 4 p.Article

Path problems in generalized stars, complete graphs, and brick wall graphsERLEBACH, Thomas; VUKADINOVIC, Danica.Discrete applied mathematics. 2006, Vol 154, Num 4, pp 673-683, issn 0166-218X, 11 p.Conference Paper

Decidability of the Star Problem in A*×{b}GASTIN, P; OCHMANSKIA, E; PETIT, A et al.Information processing letters. 1992, Vol 44, Num 2, pp 65-71, issn 0020-0190Article

  • Page / 1